The Large Deviation Principle for Interacting Dynamical Systems on Random Graphs

Using the weak convergence approach to large deviations, we formulate and prove deviation principle (LDP) for W-random graphs in cut-norm topology. This generalizes LDP Erd?s–Rényi random by Chatterjee Varadhan. Furthermore, translate a class of interacting dynamical systems on such graphs. To this end, demonstrate that solutions models depend continuously underlying with respect apply contraction principle.